Markovian Bulk Service Queue under Accessibility Rules
نویسندگان
چکیده
منابع مشابه
A Bulk Service Queue with a Choice of Service and Re-Service under Bernoulli Schedule
This paper investigates the queueing process of a bulk service queueing system under Bernoulli schedule. It also generalizes some known scenarios concerning the choice of service and re-service types. The queueing process is studied both in discrete time and in continuous time. Performance measures are derived and used to implement an optimal management policy of the system.
متن کاملA Finite Capacity Bulk Service Queue with Single Vacation and Markovian Arrival Process
Vacation time queues with Markovian arrival process (MAP) are mainly useful in modeling and performance analysis of telecommunication networks based on asynchronous transfer mode (ATM) environment. This paper analyzes a single-server finite capacity queue wherein service is performed in batches of maximum size “b” with a minimum threshold “a” and arrivals are governed by MAP. The server takes a...
متن کاملPH/PH/1 Bulk Arrival and Bulk Service Queue
This paper studies two stochastic bulk arrivals and bulk services PH/PH/1 queue Models (A) and (B) with k_(1 ) and k_2 as the number of phases of PH arrival and PH service distributions respectively. The system has infinite storing capacity and the arrival and service sizes are finite valued random variables. Matrix partitioning method is used to study the models. In Model (A) the maximum of th...
متن کاملANALYSIS OF FINITE BUFFER RENEWAL INPUT QUEUE WITH BALKING AND MARKOVIAN SERVICE PROCESS
This paper presents the analysis of a renewal input finite buffer queue wherein the customers can decide either to join the queue with a probability or balk. The service process is Markovian service process ($MSP$) governed by an underlying $m$-state Markov chain. Employing the supplementary variable and imbedded Markov chain techniques, the steady-state system length distributions at pre...
متن کاملFinite Buffer Vacation Queue under E-limited with Limit Variation Service and Batch Markovian Arrival Process
Abstract: We consider a finite-buffer single server queue with single (multiple) vacation(s) under batch Markovian Arrival Process (BMAP). The service discipline is varying number limited service, also called E-limited with limit variation (ELV) where the server serves until either the system is emptied or a randomly chosen limit of l customers have been served. Queue length distributions at va...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Computer Applications
سال: 2013
ISSN: 0975-8887
DOI: 10.5120/9890-4449